Graphical Models and Point Pattern Matching
نویسندگان
چکیده
منابع مشابه
Faster graphical models for point-pattern matching.
It has been shown that isometric matching problems can be solved exactly in polynomial time, by means of a Junction Tree with small maximal clique size. Recently, an iterative algorithm was presented which converges to the same solution an order of magnitude faster. Here, we build on both of these ideas to produce an algorithm with the same asymptotic running time as the iterative solution, but...
متن کاملPattern Matching in Models
The goal of this paper is to investigate how such a pattern matching could be performed on models, including the definition of the input language as well as the elaboration of efficient matching algorithms. Design patterns can be considered reusable micro-architectures that contribute to an overall system architecture. Frameworks are also closely related to design patterns. Components offer the...
متن کاملGraphical models for graph matching: Approximate models and optimal algorithms
Comparing scene, pattern or object models to structures in images or determining the correspondence between two point sets are examples of attributed graph matching. In this paper we show how such problems can be posed as one of inference over hidden Markov random fields. We review some well known inference methods studied over past decades and show how the Junction Tree framework from Graphica...
متن کاملModels of String Pattern Matching
1. Introduction In an earlier report [1], a model for string pattern matching in the style of SNOBOL4 was developed using Icon. That report showed how most of the pattern-matching mechanism of SNOBOL4 could be translated into Icon and, in effect, provided a model for implementing pattern matching in the style of SNOBOL4.
متن کاملA new approach to point pattern matching
We describe a new algorithm for matching star lists, given by their two-dimensional coordinates. Such matching should be unaffected by translation, rotation, rescaling, random perturbations, and some random additions and deletions of coordinate couples in one list relative to another. The first phase of the algorithm is based on a characterization of a set of coordinate couples, relative to eac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2006
ISSN: 0162-8828,2160-9292
DOI: 10.1109/tpami.2006.207